The Pohlig-Hellman Method Generalized for Group Structure Computation
نویسنده
چکیده
We present a new algorithm that extends the techniques of the Pohlig-Hellman algorithm for discrete logarithm computation to the following situation: Given a nite abelian group and group elements h, g1; : : : ; g l , compute the least positive integer y and numbers x1 ; : : : ; x l such that h y = Q gi x i. This computational problem is important for computing the structure of a nite abelian group.
منابع مشابه
Structure computation and discrete logarithms in finite abelian p-groups
We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig–Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for H without using a relation matrix. The problem of computing a basis for some or all of the Sylow p-subgroups of an arbitrary finite abelian group G is addres...
متن کاملGroups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures
In discrete logarithm based cryptography, a method by Pohlig and Hellman allows solving the discrete logarithm problem efficiently if the group order is known and has no large prime factors. The consequence is that such groups are avoided. In the past, there have been proposals for cryptography based on cyclic infrastructures. We will show that the Pohlig-Hellman method can be adapted to certai...
متن کاملSolving the Discrete Logarithm Problem for Ephemeral Keys in Chang and Chang Password Key Exchange Protocol
The present study investigates the difficulty of solving the mathematical problem, namely the DLP (Discrete Logarithm Problem) for ephemeral keys. The DLP is the basis for many public key cryptosystems. The ephemeral keys are used in such systems to ensure security. The DLP defined on a prime field p Z * of random prime is considered in the present study. The most effective method to solve the ...
متن کاملA Small Subgroup Attack for Recovering Ephemeral Keys in Chang and Chang Password Key Exchange Protocol
Three-party authenticated key exchange protocol is an important cryptographic technique in the secure communication areas. Recently Chang and Chang proposed a novel three party simple key exchange protocol and claimed the protocol is secure, efficient and practical. Unless their claim, a key recovery attack is proposed on the above protocol by recovering the ephemeral keys. One way of recoverin...
متن کاملSimple and efficient threshold cryptosystem from the Gap Diffie-Hellman group
In this paper, we construct a new threshold cryptosystem from the Gap Diffie-Hellman (GDH) group. The proposed scheme enjoys all the most important properties that a robust and practical threshold cryptosystem should possess, that is, it is noninteractive, computationally efficient and provably secure against adaptive chosen ciphertext attacks. In addition, thanks to the elegant structure of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 27 شماره
صفحات -
تاریخ انتشار 1999